Secret key exchange in ultralong lasers by radiofrequency spectrum coding
نویسندگان
چکیده
منابع مشابه
Mobile Secret Key Distribution with Network Coding
We consider the problem of secret key distribution in a sensor network with multiple scattered sensor nodes and a mobile device that can be used to bootstrap the network. Our main contribution is a practical scheme that relies on network coding to provide a robust and low-complexity solution for sharing secret keys among sensor nodes. In spite of its role as a key enabler for this approach, the...
متن کاملEulerian Secret Key Exchange ( Extended Abstract )
Designing a protocol to exchange a secret key is one of the most fundamental subjects in cryptography. Using a random deal of cards, pairs of card players (agents) can share information-theoretically secure keys that are secret from an eavesdropper. In this paper we first introduce the notion of an Eulerian secret key exchange, in which the pairs of players sharing secret keys form an Eulerian ...
متن کاملPhysical-Layer-Enhanced Wireless Secret Key Exchange
We address the problem of efficiently establishing a shared secret key over an open wireless channel in the presence of an active (jamming) adversary. A commonly employed technique in practice for key sharing is the cryptographic ellipticcurve Diffie-Hellman (DH) protocol; however, its communication cost in a jammed environment is very high. Hence, we employ novel physical-layer techniques to e...
متن کاملNetwork Coding Protocols for Secret Key Distribution
Recent contributions have uncovered the potential of network coding, i.e. algebraic mixing of multiple information flows in a network, to provide enhanced security in packet oriented wireless networks. We focus on exploiting network coding for secret key distribution in a sensor network with a mobile node. Our main contribution is a set of extensions for a simple XOR based scheme, which is show...
متن کاملCoding Theorems for Secret - Key Authentication Systems ∗
This paper provides the Shannon theoretic coding theorems on the success probabilities of the impersonation attack and the substitution attack against secret-key authentication systems. Though there are many studies that develop lower bounds on the success probabilities, their tight upper bounds are rarely discussed. This paper characterizes the tight upper bounds in an extended secret-key auth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Light: Science & Applications
سال: 2015
ISSN: 2047-7538
DOI: 10.1038/lsa.2015.49